Multi-Stage Overload Removal under Operating Constraints
نویسندگان
چکیده
منابع مشابه
A stochastic model for operating room planning under uncertainty and equipment capacity constraints
In the present economic context, the operating theater is considered as a critical activity in health care management. This paper describes a model for operating room (OR) planning under constraint of a unique equipment. At first level we schedule elective surgeries under the uncertainty of using a unique equipment. At the second level we consider emergency surgeries, and at the third le...
متن کاملALBATROSS An Operating-System under hard Realtime-Constraints
Based on the experiences from an autonomous mobile robot project called MOBOT-III, we found hard realtime-constraints for the operating-system-design. ALBATROSS is “A flexible multi-tasking and realtime network-operating-system-kernel”. The focus in this article is on a communication-scheme fulfilling the previous demanded assurances. The central chapters discuss the shared buffer management an...
متن کاملIntegrated safety stock management for multi-stage supply chains under production capacity constraints
In the petrochemical, chemical and pharmaceutical industries, supply chains typically consist of multiple stages of production facilities, warehouse/distribution centers, logistical subnetworks and end customers. Supply chain performance in the face of variousmarket and technical uncertainties is usuallymeasured by service level, that is, the expected fraction of demand that the supply chain ca...
متن کاملMining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multilevel association rules uses concept hierarchies, also called taxonomies and defined as relations of type 'is-a' between objects, to extract rules that items belong to different levels of abstraction. These rules are m...
متن کاملMulti-robot routing under connectivity constraints
This paper addresses the problem of routing multiple range constrained robots to service spatially distributed requests at specified time instants, while ensuring a connected information exchange network at all times. We discuss the feasibility aspects of such a connectivity constrained routing problem. In particular, we derive the minimum number of robots required to service such requests, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Power and Energy
سال: 1973
ISSN: 0385-4213,1348-8147
DOI: 10.1541/ieejpes1972.93.485